IT256 DATA STRUCTURES AND ALGORITHMS
Subject Cordinator: - Prof. Purvi Prajapti
Subject Name: - DATA STRUCTURES AND ALGORITHMS
Semester: - 4
| Title of the unit | Minimum number of hours | |
|---|---|---|
| 1 |
Introduction to Data Structure |
04 |
| 2 | Linear Data Structure | 20 |
| 3 |
Non Linear Data Structure |
20 |
| 4 | Searching and Sorting | 10 |
| 5 | Hashing | 06 |
| Unit No. | Topics | Teaching Hours |
|---|---|---|
| 1 |
INTRODUCTION TO DATA STRUCTURE 1.1 Introduction Introduction to Data, Information, Data Type Different types of Data Type : Built-In and Abstract Data Type 1.2 Algorithm and Data Structure Algorithm, Program Introduction to Data Structure, Needs for Data Structure Different types of Data Structure |
04 |
| 2 |
LINEAR DATA STRUCTURE 2.1 Array Notations : one dimension, two dimension and multi dimension Memory Representation of Array : Row Order and Column Order Concept of Sparse Matrices 2.2 Stack Memory Representation of Stack Operations : push, pop, peep, change Applications of Stack: Recursion : Recursive Function Tracing, Tower of Hanoi Conversion : Infix to Postfix Evaluation : Prefix and Postfix expression 2.3 Queue Memory Representation of queue Simple Queue : Insert and Delete operation Circular Queue : Insert and Delete operation Concepts of : Priority Queue, Double-ended Queue Applications of Queue 2.4 Linked List Memory Representation of LL Singly Linked List: Insert at First, Insert at End, Insert according to Sorted order, Delete the specified node. Doubly Linked List : Insert and Delete operation Concept of Circular Linked List Applications of Link List |
20 |
| 3 |
NON LINEAR DATA STRUCTURE 3.1 Tree Tree Concepts (Tree, Binary, Full Binary, Complete Binary) Memory Representation of Tree Tree Traversal Techniques : Pre-order, Post-order and In-order (Recursive and Iterative) Binary Search Tree: Iterative and Recursive: Insert and Delete Operations with all options. Concept of Threaded Binary Tree, B- Tree General Tree to Binary Tree Conversion Height-Balance Tree(AVL Tree) : Insert and Delete Operations Applications of Tree : Manipulation of Arithmetic Expression, Decision Tree, Hierarchical Tree(Family Tree), Directory structure of File system 3.2 Graph Graph concepts (undirected, directed, simple, multi, weighted, null, mixed, cycle, path, forest) Memory Representation of Graph, BFS and FS, Applications of Graph |
20 |
| 4 | SEARCHING AND SORTING 4.1 Searching Sequential Search ,Binary Search : Iterative and Recursive 4.2 Sorting Different Sorting Techniques Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Radix Sort, Heap Sort |
10 |
| 5 | HASHING 5.1 Hashing Collision-Resolution Techniques : rehashing and chaining Different Hashing Functions: Division, Mid-square, Folding, Length-dependent, Digit Analysis, Multiplicative Applications of Hashing |
06 |
| Reading Materials |
|---|
| Online Course: Click Here |
|
Array:
Notes: Click Here Video Lecture: Click Here Video Lecture: Click Here Assignment: Click Here Programming Practice: Click Here Programming Practice: Click Here Gate Question: Click Here |
| Textbooks |
|---|
| An Introduction to Data Structures with Applications, Jean-Paul Tremblay, Paul G. Sorenson, McGraw-hill. |